Model checking of causal knowledge formulas
نویسندگان
چکیده
منابع مشابه
Efficient Model Checking of Causal-Knowledge Protocols
A model checking algorithm for proving correctness of causal knowledge protocols for multi-agent systems is given. Protocols are spec-iied in an extension of the temporal logic of causal knowledge 18]. The temporal language is interpreted over labelled prime event structures. The epistemic operators correspond to knowledge and goals, whereas the temporal modalities correspond to the immediate c...
متن کاملModel Checking with Quantified Boolean Formulas
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...
متن کاملModel Checking LTLR Formulas under Localized Fairness
Many temporal logic properties of interest involve both state and action predicates and only hold under suitable fairness assumptions. Temporal logics supporting both state and action predicates such as the Temporal Logic of Rewriting (TLR) can be used to express both the desired properties and the fairness assumptions. However, model checking such properties directly can easily become impossib...
متن کاملModel checking of causal knowledgeformulas 1
A model checking algorithm for a variant of the temporal logic of causal knowledge 25] is given. The temporal language is interpreted over labelled prime event structures. Knowledge operators express agents' history knowledge and the knowledge acquired about other agents. The temporal modalities correspond to the immediate causality and causality. For systems represented by deterministic Asynch...
متن کاملRefinement of LTL Formulas for Abstract Model Checking
A crucial problem in abstract model checking is to find a tradeoff between constructing the “best” (the smallest) abstract model, approximating a given model, and preserving as much interesting properties over the original model as possible. In this paper, we present a method for dealing with this problem based on the definition of a new abstract satisfiability relation. This new relation allow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)82524-1